Associating a numerical semigroup to the triangle-free configurations
نویسندگان
چکیده
منابع مشابه
The semigroup of combinatorial configurations
A (v, b, r, k) combinatorial configuration is a (r, k)-biregular bipartite graph with v vertices on the left and b vertices on the right and with no cycle of length 4. Combinatorial configurations have become very important for some cryptographic applications to sensor networks and to peerto-peer communities. Configurable tuples are those tuples (v, b, r, k) for which a (v, b, r, k) combinatori...
متن کاملSmall Triangle-Free Configurations of Points and Lines
In the paper we show that all combinatorial triangle-free configurations for v ≤ 18 are geometrically realizable. We also show that there is a unique smallest astral (183) triangle-free configuration and its Levi graph is the generalized Petersen graph G(18, 5). In addition, we present geometric realizations of the unique flag transitive triangle-free configuration (203) and the unique point tr...
متن کاملSome Configurations of Triangle Centers
Many collections of triangle centers and symmetrically defined triangle points are vertices of configurations. This illustrates a high level of organization among the points and their collinearities. Some of the configurations illustrated are inscriptable in Neuberg’s cubic curve and others arise from Monge’s theorem.
متن کاملFree Semigroup Algebras a Survey
Free semigroup algebras are wot-closed algebras generated by n isometries with pairwise orthogonal ranges. They were introduced in [27] as an interesting class of operator algebras in their own right. The prototype algebra, obtained from the left regular representation of the free semigroup on n letters, was introduced by Popescu [45] in connection with multi-variable non-commutative dilation t...
متن کاملTriangle-free subgraphs in the triangle-free process
Consider the triangle-free process, which is defined as follows. Start with G(0), an empty graph on n vertices. Given G(i − 1), let G(i) = G(i − 1) ∪ {g(i)}, where g(i) is an edge that is chosen uniformly at random from the set of edges that are not in G(i − 1) and can be added to G(i − 1) without creating a triangle. The process ends once a maximal triangle-free graph has been created. Let H b...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in Mathematics of Communications
سال: 2011
ISSN: 1930-5346
DOI: 10.3934/amc.2011.5.351